Arbitrarily varying channels with constrained inputs and states
نویسندگان
چکیده
منابع مشابه
Arbitrarily varying channels with constrained inputs and states
Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with constraints on the transmitted codewords and channel state sequences. We consider two types of constraints peak (i.e., required for eacb n-length sequence almost d y ) and average (over the message set or over an ensemble). For peak constraints on the c o d e d and on the channel state sequences, ...
متن کاملMIMO Wiretap Channels with Arbitrarily Varying Eavesdropper Channel States
In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wire...
متن کاملDeterministic list codes for state-constrained arbitrarily varying channels
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission....
متن کاملGaussian arbitrarily varying channels
The arbitrarily varying channel (AVC) can be interpreted as a model of a channel jammed by an intelligent and unpredictable adversary. We investigate the asymptotic reliability of optimal random block codes on Gaussian arbitrarily varying channels (GAVC’s). A GAVC is a discrete-time memoryless Gaussian channel with input power constraint PT and noise power N,, which is further corrupted by an a...
متن کاملOn Quantum Communication Channels with Constrained Inputs
The purpose of this work is to extend results of previous papers [13], [2] to quantum channels with additive constraints onto the input signal, by showing that the capacity of such channel is equal to the supremum of the entropy bound with respect to all apriori distributions satisfying the constraint. We also make an extension to channels with continuous alphabet. As an application, we prove t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1988
ISSN: 0018-9448,1557-9654
DOI: 10.1109/18.2598